On secret sharing communication systems with two or three channels

permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. 387 Ahsfruct-The source coding problem is considered for secret sharing communication systems (SSCs's) with two or three channels. The SSCS, where the information X is shared and communicated through two or more channels, is an extension of Shannon's cipher communication system and the secret sharing system. The security level is measured with equivocation; that is, (l/N)H(XI&), (l/N)H(XIKq), etc., where & and WJ are the wire-tapped codewords. The achievable rate region for the given security level is established for the SSCS's with two or three channels.